Fast Detection of Connected Components in Large Scale Graphs Using MapReduce
نویسندگان
چکیده
منابع مشابه
Fast Detection of Connected Components in Large Scale Graphs Using MapReduce
Finding connected components of a graph is a fundamental problem in graph theory which arises in many different applications including data mining and network analysis. By increasing popularity of social networks and information systems, scale of real world graphs have increased to billions of nodes and edges. Thus, finding connected components of large scale graphs turned to be a computational...
متن کاملAnalyzing Patterns in Large-Scale Graphs Using MapReduce in Hadoop
Analyzing patterns in large-scale graphs, such as social networks (e.g. Facebook, Linkedin, Twitter) has many applications including community identification, blog analysis, intrusion and spamming detections. Currently, it is impossible to process information in large-scale graphs with millions even billions of edges with a single computer. In this paper, we take advantage of MapReduce, a progr...
متن کاملCC-MR - Finding Connected Components in Huge Graphs with MapReduce
The detection of connected components in graphs is a wellknown problem arising in a large number of applications including data mining, analysis of social networks, image analysis and a lot of other related problems. In spite of the existing very efficient serial algorithms, this problem remains a subject of research due to increasing data amounts produced by modern information systems which ca...
متن کاملFast Isomorphism Testing of Graphs with Regularly-Connected Components
The Graph Isomorphism problem has both theoretical and practical interest. In this paper we present an algorithm, called conauto-1.2, that efficiently tests whether two graphs are isomorphic, and finds an isomorphism if they are. This algorithm is an improved version of the algorithm conauto, which has been shown to be very fast for random graphs and several families of hard graphs [9]. In this...
متن کاملTechnical Report: On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs
Detecting strongly connected components (SCCs) in a directed graph is a fundamental graph analysis algorithm that is used in many science and engineering domains. Traditional approaches in parallel SCC detection, however, show limited performance and poor scaling behavior when applied to large real-world graph instances. In this paper, we investigate the shortcomings of the conventional approac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Engineering
سال: 2014
ISSN: 2278-8719,2250-3021
DOI: 10.9790/3021-04263542